Gabidulin Codes With Support Constrained Generator Matrices
نویسندگان
چکیده
منابع مشابه
Generalised Twisted Gabidulin Codes
We present a new family of maximum rank distance (MRD) codes. The new class contains codes that are neither equivalent to a generalised Gabidulin nor to a twisted Gabidulin code, the only two known general constructions of linear MRD codes.
متن کاملGeneralized Twisted Gabidulin Codes
Based on the twisted Gabidulin codes obtained recently by Sheekey, we construct a new family of maximal rank distance codes as a set of qpolynomials over Fqn , which includes the generalized Gabidulin codes and the twisted Gabidulin codes. Their Delsarte duals and adjoint codes are investigated. We also obtain necessary and sufficient conditions for the equivalence between two members of our ne...
متن کاملZ2Z4-linear codes: generator matrices and duality
A code ${\cal C}$ is $\Z_2\Z_4$-additive if the set of coordinates can be partitioned into two subsets $X$ and $Y$ such that the punctured code of ${\cal C}$ by deleting the coordinates outside $X$ (respectively, $Y$) is a binary linear code (respectively, a quaternary linear code). In this paper $\Z_2\Z_4$-additive codes are studied. Their corresponding binary images, via the Gray map, are $\Z...
متن کاملGeneralized Reed-Solomon Codes with Sparsest and Balanced Generator Matrices
We prove that for any positive integers n and k such that n≥ k≥ 1, there exists an [n, k] generalized Reed-Solomon (GRS) code that has a sparsest and balanced generator matrix (SBGM) over any finite field of size q ≥ n+ ⌈ k(k−1) n ⌉, where sparsest means that each row of the generator matrix has the least possible number of nonzeros, while balanced means that the number of nonzeros in any two c...
متن کاملOn deep-holes of Gabidulin codes
In this paper, we determine a class of deep holes for Gabidulin codes with both rank metric and Hamming metric. Moreover, we give a necessary and sufficient condition for deciding whether a word is not a deep hole for Gabidulin codes, by which we study the error distance of two special classes of words to certain Gabidulin codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2020
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2019.2955106